A New Heuristic-em for Permutation Flowshop Scheduling
نویسندگان
چکیده
This paper applies the new developed heuristic electromagnetism-like mechanism (EM) algorithm for the permutation flowshop scheduling problem. This algorithm simulates the electromagnetism theory by considering each solution as an electrical charge. Through the attraction-repulsion of the charges, solutions move to the optimality without being trapped into local optima. We make use of random key for building the relationships between the algorithm and the problem model. When comparing the computational results with GA and other heuristics, EM showed great superiority than the others, especially for some large scaled scheduling problems. Copyright © 2006 IFAC
منابع مشابه
A Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times
We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...
متن کاملA New Heuristic Method for Minimizing the Makespan in a No-idle Permutation Flowshop
This paper deals with the no-idle permutation flowshop sequencing in order to minimize the total time of completing the schedule (makespan). A heuristic denoted by NB is introduced, which is compared with the best heuristics reported in the literature. An extensive computational experiment was carried out for the performance evaluation of the proposed heuristic. Experimental results clearly sho...
متن کاملA combinatorial particle swarm optimisation for solving permutation flowshop problems
The m-machine permutation flowshop problem PFSP with the objectives of minimizing the makespan and the total flowtime is a common scheduling problem, which is known to be NP-complete in the strong sense, when m P 3. This work proposes a new algorithm for solving the permutation FSP, namely combinatorial Particle Swarm Optimization. Furthermore, we incorporate in this heuristic an improvement pr...
متن کاملکمینهسازی حداکثر دیرکرد کارها در مسأله زمانبندی جریان کارگاهی جایگشتی دوباره وارد شونده چند ماشینه
This investigation considers a reentrant permutation flowshop scheduling problem whose performance criterion is maximum tardiness. The reentrant flowshop (RFS) is a natural extension of the classical flowshop by allowing a job to visit certain machines more than once. The RFS scheduling problem, in which the job order is the same for each machine in each layer, is called a reentrant permutati...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کامل